BVAGQ-AR for Fragmented Database Replication Management

Large amounts of data have been produced at a rapid rate since the invention of computers. This condition is the key motivation for up-to-date and forthcoming research frontiers. Replication is one of the mechanisms for managing data, since it improves data accessibility and reliability in the distributed database environment. In recent years, the amount of various data grows rapidly with widely available low-cost technology. Although we have been packed with data, we still have lacked of knowledge. Nevertheless, if the impractical data is used in database replication, this will cause waste of data storage and the time taken for a replication process will be delayed. This paper proposes Binary Vote Assignment on Grid Quorum with Association Rule (BVAGQ-AR) algorithm in order to handle fragmented database synchronous replication. BVAGQ-AR algorithm is capable for partitioning the database into disjoint fragments. Fragmentation in distributed database is very useful in terms of usage, reliability and efficiency. Managing fragmented database replication becomes a concern for the administrator because the distributed database is disseminated into split replica partitions. The result from the experiment shows that handling fragmented database synchronous replication through proposed BVAGQ-AR algorithm able to preserve data consistency in distributed environment

Applications of ontology in the internet of things: A systematic analysis

Ontology has been increasingly implemented to facilitate the Internet of Things (IoT) activities, such as tracking and information discovery, storage, information exchange, and object addressing. However, a complete understanding of using ontology in the IoT mechanism remains lacking. The main goal of this research is to recognize the use of ontology in the IoT process and investigate the services of ontology in IoT activities. A systematic literature review (SLR) is conducted using predefined protocols to analyze the literature about the usage of ontologies in IoT. The following conclusions are obtained from the SLR. (1) Primary studies (i.e., selected 115 articles) have addressed the need to use ontologies in IoT for industries and the academe, especially to minimize interoperability and integration of IoT devices. (2) About 31.30% of extant literature discussed ontology development concerning the IoT interoperability issue, while IoT privacy and integration issues are partially discussed in the literature. (3) IoT styles of modeling ontologies are diverse, whereas 35.65% of total studies adopted the OWL style. (4) The 32 articles (i.e., 27.83% of the total studies) reused IoT ontologies to handle diverse IoT methodologies. (5) A total of 45 IoT ontologies are well acknowledged, but the IoT community has widely utilized none. An in-depth analysis of different IoT ontologies suggests that the existing ontologies are beneficial in designing new IoT ontology or achieving three main requirements of the IoT field: interoperability, integration, and privacy. This SLR is finalized by identifying numerous validity threats and future directions

Late Acceptance Hill Climbing Based Strategy for Test Redundancy Reduction and Prioritization

Software testing relates to the process of accessing the functionality of a program. To ensure conformance, test engineers often generate a set of test cases to validate against the user requirements. When dealing with large line of codes (LOCs), there are potentially issues of redundancy as new test cases may be added and old test cases may be deleted during the whole testing process. To address redundancy issues, many useful strategies (e.g. HGS, GE, and GRE) have been developed in the literature. These strategies often put focus on getting the most minimum test suite size but give poor emphasis on test prioritization (i.e. ordering of tests). Here, as most testing activities happen toward the end of software development, testers are often forced to consider partial test suite, that is, to be in line with the project deadline. In this manner, some impactful defects may be missed owing to the need to accommodate deadline shift from earlier development activities. In order to address these issues, this paper highlights our on-going work on the development of a novel test redundancy reduction strategy based Late Acceptance Hill Climbing, called (LAHCS). LAHCS is the first known strategy that adopts Late Acceptance Hill Climbing Algorithm for test redundancy reduction and prioritization

Comparative Benchmarking of Constraints T-Way Test Generation Strategy Based on Late Acceptance Hill Climbing Algorithm

This paper describes the new t-way strategy based the Late Acceptance based Hill Climbing algorithm, called LAHC, for constraints t-way test generation. Unlike earlier competing work, LAHC does not require significant tuning in order to have it working. In fact, LAHC merely requires minor adjustment of the common controlling parameters involving iteration and population size depending on the given system configuration. Our benchmarking results have been promising as LAHC gives competitive results in most constraints configurations considered

Comparative Benchmarking Of Constraints T-Way Test Generation Strategy Based On Late Acceptance Hill Climbing Algorithm

This paper describes the new t-way strategy based the Late Acceptance based Hill Climbing algorithm, called LAHC, for constraints t-way test generation. Unlike earlier competing work, LAHC does not require significant tuning in order to have it working. In fact, LAHC merely requires minor adjustment of the common controlling parameters involving iteration and population size depending on the given system configuration. Our benchmarking results have been promising as LAHC gives competitive results in most constraints configurations considered

Generating t-way Test Suite in the Presence of Constraints

Interaction (t-way) testing is a common sampling strategy to minimize combinatorial test data from large configuration space based on the defined interaction strength (t). Here, all t-way strategies generate the t-way test suite with the aim to cover every possible combination produced by the interacting parameters (or also known as tuples). In many systems under test (SUT), there are some known combinations that are impossible to occur based on the requirements set to the system. These combinations (termed constraints) have to be excluded from the final test suite. This paper describes the generation of t-way test suite using the Late Acceptance Hill Climbing based Strategy (LAHC) in the presence of constraints. Our benchmarking results have been promising as LAHC gives competitive results in many constraints configurations considered

Simulated Annealing Based Strategy for Test Redundancy Reduction

Software testing relates to the process of accessing the functionality of a program against some defined specifications. To ensure conformance, test engineers often generate a set of test cases to validate against the user requirements. When dealing with large line of codes (LOCs), there are potentially issue of redundancies as new test cases may be added and old test cases may be deleted during the whole testing process. In order to address this issue, we have developed a new strategy, called tReductSA, to systematically minimize test cases for testing consideration. Unlike existing works which rely on the Greedy approaches, our work adopts the random sequence permutation and optimization algorithm based on Simulated Annealing with systematic merging technique. Our benchmark experiments demonstrate that tReductSA scales well with existing works (including that of GE, GRE and HGS) as far as optimality is concerned. On the other note, tReductSA also offers more diversified solutions as compared to existing work